Comparison of local and global undirected graphical models
نویسندگان
چکیده
CRFs are discriminative undirected models which are globally normalized. Global normalization preserves CRFs from the label bias problem which most local models suffer from. Recently proposed co-occurrence rate networks (CRNs) are also discriminative undirected models. In contrast to CRFs, CRNs are locally normalized. It was established that CRNs are immune to the label bias problem even they are local models. In this paper, we further compare ECRNs (using fully empirical relative frequencies, not by support vector regression) and CRFs. The connection between Co-occurrence Rate, which is the exponential function of pointwise mutual information, and Copulas is built in continuous case. Also they are further evaluated statistically by experiments.
منابع مشابه
Distributed Parameter Estimation in Probabilistic Graphical Models
This paper presents foundational theoretical results on distributed parameter estimation for undirected probabilistic graphical models. It introduces a general condition on composite likelihood decompositions of these models which guarantees the global consistency of distributed estimators, provided the local estimators are consistent.
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Standard Imsets for Undirected and Chain Graphical Models
We derive standard imsets for undirected graphical models and chain graphical models. Standard imsets for undirected graphical models are described in terms of minimal triangulations for maximal prime subgraphs of the undirected graphs. For describing standard imsets for chain graphical models, we first define a triangulation of a chain graph. We then use the triangulation to generalize our res...
متن کاملA Deterministic Annealing Approach to Learning Bayesian Networks
Graphical Models bring together two different mathematical areas: graph theory and probability theory. Recent years have witnessed an increase in the significance of the role played by Graphical Models in solving several machine learning problems. Graphical Models can be either directed or undirected. Undirected Graphical Models are also called Bayesian networks. The manual construction of Baye...
متن کاملGraphical Models and Exponential Families
We provide a classi cation of graphical models according to their representation as subfamilies of exponential families. Undirected graphical models with no hidden variables are linear exponential families (LEFs), directed acyclic graphical models and chain graphs with no hidden variables, including Bayesian networks with several families of local distributions, are curved exponential families ...
متن کاملMarginal AMP Chain Graphs
We present a new family of graphical models that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them can be seen as the result of marginalizing out some nodes in an AMP chain graph. However, MAMP chain graphs do not only subsume AMP chain graphs but also regression chain graphs. We describe global and local Markov pr...
متن کامل